New Results on Multi-Receiver Authentication Codes
نویسندگان
چکیده
Multi-receiver authentication is an extension of traditional point-to-point message authentication in which a sender broadcasts a single authenticated message such that all the receivers can independently verify the authenticity of the message, and malicious groups of up to a given size of receivers can not successfully impersonate the transmitter, or substitute a transmitted message. This paper presents some new results on unconditionally secure multi-receiver authentication codes. First we generalize a polynomial construction due to Desmedt, Frankel and Yung, to allow multiple messages be authenticated with each key. Second, we propose a new flexible construction for multi-receiver A-code by combining an A-code and an (n, m, k)-cover-free family. Finally, we introduce the model of multi-receiver A-code with dynamic sender and present an efficient construction for that.
منابع مشابه
A New Construction of Multi-receiver Authentication Codes from Pseudo-Symplectic Geometry over Finite Fields
Multi-receiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we constructed one multi-receiver authentication codes from pseudo-symplectic geometry over finite fields. The parameters and the probabilities of deceptions of this codes are also computed.
متن کاملLinear Authentication Codes from Free Modules: Bounds and Constructions
In this paper, we principally introduce a new class of unconditionally secure authentication codes, called linear authentication codes(or linear A-codes)from free modules. We then derive an upper bound on the size of source space when other parameters of the system, that is, the sizes of the key space and authenticator space, and the deception probability are fixed. We give constructions that a...
متن کاملSome New Constructions of Authentication Codes with Arbitration and Multi-Receiver from Singular Symplectic Geometry
متن کامل
Multi-receiver Homomorphic Authentication Codes for Network Coding
We investigate a new class of authenticate codes (A-codes) that support verification by a group of message recipients in the network coding setting. That is, a sender generates an A-code over a message such that any intermediate node or recipient can check the authenticity of the message, typically to detect pollution attacks. We call such an A-code as multi-receiver homomorphic A-code (MRHA-co...
متن کاملBounds and Combinatorial Structure of (k; N) Multi-receiver A-codes
In the model of (k; n) multi-receiver authentication codes (A-codes), a transmitter broadcasts a message m to n receivers in such a way that not only an outside opponent but also any k ? 1 receivers cannot cheat any other receiver. In this paper, we derive lower bounds on the cheating probabilities and the sizes of keys of (k; n) multi-receiver A-codes. The scheme proposed by Desmedt, Frankel a...
متن کامل